A mixed mode BIST scheme based on reseeding of folding counters

نویسندگان

  • Sybille Hellebrand
  • Hans-Joachim Wunderlich
  • Huaguo Liang
چکیده

In this paper a new scheme for deterministic and mixed mode scan-based BIST is presented. It relies on a new type of test pattern generator which resembles a programmable Johnson counter and is called folding counter. Both the theoretical background and practical algorithms are presented to characterize a set of deterministic test cubes by a reasonably small number of seeds for a folding counter. Combined with classical approaches for test width compression and with pseudorandom pattern generation these new techniques provide an efficient and flexible solution for scan-based BIST. Experimental results show that the proposed scheme outperforms previously published approaches based on the reseeding of LFSRs or Johnson counters.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generation of Vector Patterns Through Reseeding of Multipe-Polynominal Linear Feedback Shift Registers

In this paper we perform a comparative analysis of the encoding efficiency of BIST schemes based on reseeding of single polynomial LFSR's as well as LFSR's with fully programmable polynomials. Full programmability gives much better encoding efficiency. For a testcube with s carebits we need only s+4 bits in contrast to s+19 bits for reseeding of single polynomials, but since it involves solving...

متن کامل

Generation of Vector Patterns through Reseeding of Multiple-polynomial Linear Feedback Shift Registers

In this paper we perform a comparative analysis of the encoding efficiency of BIST schemes based on reseeding of single polynomial LFSR's as well as LFSR's with fully programmable polynomials. Full programmability gives much better encoding efficiency. For a testcube with s carebits we need only s+4 bits in contrast to s+19 bits for reseeding of single polynomials, but since it involves solving...

متن کامل

An E cient BIST Scheme Based on Reseeding of Multiple Polynomial Linear Feedback Shift Registers

In this paper we describe an optimized BIST scheme based on reseeding of multiple polynomial Linear Feedback Shift Registers LFSRs The same LFSR that is used to gen erate pseudo random patterns is loaded with seeds from which it produces vectors that cover the testcubes of dif cult to test faults The scheme is compatible with scan design and achieves full coverage as it is based on random patte...

متن کامل

BIST Scheme Based on Reseeding ofMultiple Polynomial Linear Feedback Shift

In this paper we describe an optimized BIST scheme based on reseeding of multiple polynomial Linear Feedback Shift Registers (LFSRs). The same LFSR that is used to generate pseudo-random patterns, is loaded with seeds from which it produces vectors that cover the testcubes of dif-cult to test faults. The scheme is compatible with scan-design and achieves full coverage as it is based on random p...

متن کامل

An E cient BIST Scheme Based on Reseeding ofMultiple Polynomial Linear Feedback Shift

In this paper we describe an optimized BIST scheme based on reseeding of multiple polynomial Linear Feedback Shift Registers (LFSRs). The same LFSR that is used to generate pseudo-random patterns, is loaded with seeds from which it produces vectors that cover the testcubes of dif-cult to test faults. The scheme is compatible with scan-design and achieves full coverage as it is based on random p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000